You are given an array of non-negative integers nums and an integer k. In one operation, you may choose any element from nums and increment it by 1.
Return the maximum product ofnumsafter at mostkoperations. Since the answer may be very large, return it modulo109 + 7. Note that you should maximize the product before taking the modulo.
Input: nums = [0,4], k = 5 Output: 20 Explanation: Increment the first number 5 times. Now nums = [5, 4], with a product of 5 * 4 = 20. It can be shown that 20 is maximum product possible, so we return 20. Note that there may be other ways to increment nums to have the maximum product.
Input: nums = [6,3,3,2], k = 2 Output: 216 Explanation: Increment the second number 1 time and increment the fourth number 1 time. Now nums = [6, 4, 3, 3], with a product of 6 * 4 * 3 * 3 = 216. It can be shown that 216 is maximum product possible, so we return 216. Note that there may be other ways to increment nums to have the maximum product.
1 <= nums.length, k <= 1050 <= nums[i] <= 106
use std::collections::BinaryHeap;implSolution{pubfnmaximum_product(nums:Vec<i32>,k:i32) -> i32{letmut nums = nums.into_iter().map(|num| -num).collect::<BinaryHeap<_>>();for _ in0..k {*nums.peek_mut().unwrap() -= 1;} nums.iter().fold(1, |acc, x| acc *(-x asi64) % 1_000_000_007)asi32}}